- packing radius
- noun
: half the distance of closest approach of atoms or ions in a crystal
Useful english dictionary. 2012.
packing radius
Look at other dictionaries:
Packing problem — Part of a series on Puzzles … Wikipedia
Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane … Wikipedia
Close-packing of spheres — hcp and fcc close packing of spheres In geometry, close packing of spheres is a dense arrangement of equal spheres in an infinite, regular arrangement (or lattice). Carl Friedrich Gauss proved that the highest average density – that is, the… … Wikipedia
Sphere packing — In mathematics, sphere packing problems are problems concerning arrangements of non overlapping identical spheres which fill a space. Usually the space involved is three dimensional Euclidean space. However, sphere packing problems can be… … Wikipedia
Circle packing — This article describes the packing of circles on surfaces. For the related article on circle packing with a prescribed intersection graph, please see the circle packing theorem. The most efficient way to pack different sized circles together is… … Wikipedia
Atomic packing factor — In crystallography, atomic packing factor (APF) or packing fraction is the fraction of volume in a crystal structure that is occupied by atoms. It is dimensionless and always less than unity. For practical purposes, the APF of a crystal structure … Wikipedia
Van der Waals radius — The van der Waals radius, r sub|w, of an atom is the radius of an imaginary hard sphere which can be used to model the atom for many purposes. It is named after Johannes Diderik van der Waals, winner of the 1910 Nobel Prize in Physics, as he was… … Wikipedia
Circle packing in a circle — is a two dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. Minimum solutions:[1] Number of unit circles Enclosing circle radius Density Optimality Diagram 1 1 1.0000 Trivially optimal … Wikipedia
Circle packing in an equilateral triangle — is a packing problem in discrete mathematics where the objective is to pack n unit circles into the smallest possible equilateral triangle. Optimal solutions are known for n < 13 and for any triangular number of circles, and… … Wikipedia
Problem of Apollonius — In Euclidean plane geometry, Apollonius problem is to construct circles that are tangent to three given circles in a plane (Figure 1); two circles are tangent if they touch at a single point. Apollonius of Perga (ca. 262 BC ndash; ca. 190 BC)… … Wikipedia
